Bounding the equivariant Betti numbers and computing the generalized Euler-Poincaré characteristic of symmetric semi-algebraic sets
نویسندگان
چکیده
Unlike the well known classical bounds due to Oleinik and Petrovskii, Thom and Milnor on the Betti numbers of (possibly non-symmetric) real algebraic varieties and semialgebraic sets, the above bound is polynomial in k when the degrees of the defining polynomials are bounded by a constant. Moreover, our bounds are asymptotically tight. As an application we improve the best known bound on the Betti numbers of the projection of a compact semi-algebraic set improving for any fixed degree the best previously known bound for this problem due to Gabrielov, Vorobjov and Zell.
منابع مشابه
Bounding the equivariant Betti numbers of symmetric semi-algebraic sets
Let R be a real closed field. The problem of obtaining tight bounds on the Betti numbers of semi-algebraic subsets of R in terms of the number and degrees of the defining polynomials has been an important problem in real algebraic geometry with the first results due to Olĕınik and Petrovskĭı, Thom and Milnor. These bounds are all exponential in the number of variables k. Motivated by several ap...
متن کاملBetti numbers of semi-algebraic sets defined by partly quadratic systems of polynomials
Let R be a real closed field, Q ⊂ R[Y1, . . . , Y`, X1, . . . , Xk], with degY (Q) ≤ 2, degX(Q) ≤ d,Q ∈ Q,#(Q) = m, and P ⊂ R[X1, . . . , Xk] with degX(P ) ≤ d, P ∈ P,#(P) = s, and S ⊂ R`+k a semi-algebraic set defined by a Boolean formula without negations, with atoms P = 0, P ≥ 0, P ≤ 0, P ∈ P ∪ Q. We prove that the sum of the Betti numbers of S is bounded by (`smd)O(m+k). This is a common ge...
متن کاملComputing the First Few Betti Numbers of Semi-algebraic Sets in Single Exponential Time
For every fixed l > 0, we describe a singly exponential algorithm for computing the first l Betti number of a given semi-algebraic set. More precisely, we describe an algorithm that given a semi-algebraic set S ⊂ Rk a semi-algebraic set defined by a Boolean formula with atoms of the form P > 0, P < 0, P = 0 for P ∈ P ⊂ R[X1, . . . ,Xk], computes b0(S), . . . , bl(S). The complexity of the algor...
متن کاملComputing the First Betti Numberand Describing the Connected Components of Semi-algebraic Sets
In this paper we describe a singly exponential algorithm for computing the first Betti number of a given semi-algebraic set. Singly exponential algorithms for computing the zero-th Betti number, and the Euler-Poincaré characteristic, were known before. No singly exponential algorithm was known for computing any of the individual Betti numbers other than the zero-th one. We also give algorithms ...
متن کاملOn the equivariant Betti numbers of symmetric semi-algebraic sets: vanishing, bounds and algorithms
Let R be a real closed field. We prove that for any fixed d, the equivariant rational cohomology groups of closed symmetric semi-algebraic subsets of Rk defined by polynomials of degrees bounded by d vanishes in dimensions d and larger. This vanishing result is tight. Using a new geometric approach we also prove an upper bound of dO(d)sdkbd/2c−1 on the equivariant Betti numbers of closed symmet...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1312.6582 شماره
صفحات -
تاریخ انتشار 2013